Reversible P Systems with Symport/Antiport Rules

A deterministic computing system is reversible if every configuration of the system has just one previous configuration or it is an initial configuration. In this paper it is proved that for every reversible register machine there exists a reversible P system with symport/antiport rules such that the P system accepts the same set of integers as the register machine accepts. The result shows that the family of sets accepted by reversible P systems with symport/antiport rules is the family of recursively enumerable sets of integers.